From a Possibility Theory View of Formal Concept Analysis to the Possibilistic Handling of Incomplete and Uncertain Contexts

نویسندگان

  • Zina Ait-Yakoub
  • Yassine Djouadi
  • Didier Dubois
  • Henri Prade
چکیده

The formal similarity between possibility theory and formal concept analysis, made ten years ago, has suggested the introduction in the latter setting of the counterpart of possibilistic operators, which were ignored before. These new operators can be related to the basic operator of formal concept analysis by a triple use of negations on the contexts, on the set-valued arguments and on the obtained results, and lead to consider new compositions worth of interest. They enable us to complete the Guigues-Duquenne basis with rules having disjunctive conclusions. Besides, the approach can be naturally generalized to incomplete contexts and then to uncertain context where uncertainty is graded.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possibility Theory and Formal Concept Analysis in Information Systems

The setting of formal concept analysis presupposes the existence of a relation between objects and properties. Knowing that an unspecified object has a given property induces a formal possibility distribution that models the set of objects known to possess this property. This view expressed in a recent work by the authors of the present paper, has led to introduce the set-valued counterpart to ...

متن کامل

A Possibility-Theoretic View of Formal Concept Analysis

The paper starts from the standard relational view linking objects and properties in formal concept analysis, here augmented with four modal-style operators (known as sufficiency, dual sufficiency, necessity and possibility operators). Formal concept analysis is mainly based on the first operator, while the others come from qualitative data analysis and can be also related to rough set theory. ...

متن کامل

Possibilistic logic: a retrospective and prospective view

Possibilistic logic is a weighted logic introduced and developed since the mid-1980s, in the setting of arti(cial intelligence, with a view to develop a simple and rigorous approach to automated reasoning from uncertain or prioritized incomplete information. Standard possibilistic logic expressions are classical logic formulas associated with weights, interpreted in the framework of possibility...

متن کامل

A multi agent method for cell formation with uncertain situation, based on information theory

This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...

متن کامل

Possibilistic Handling of Uncertain Default Rules with Applications to Persistence Modeling and Fuzzy Default Reasoning

Default rules express concise pieces of knowledge having implicit exceptions, which is appropriate for reasoning under incomplete information. Specific rules that explicitly refer to exceptions of more general rules can then be handled in this non-monotonic setting. However, there is no assessment of the certainty with which the conclusion of a default rule holds when it applies. We propose a f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016